residue cryptosystem - definizione. Che cos'è residue cryptosystem
Diclib.com
Dizionario ChatGPT
Inserisci una parola o una frase in qualsiasi lingua 👆
Lingua:

Traduzione e analisi delle parole tramite l'intelligenza artificiale ChatGPT

In questa pagina puoi ottenere un'analisi dettagliata di una parola o frase, prodotta utilizzando la migliore tecnologia di intelligenza artificiale fino ad oggi:

  • come viene usata la parola
  • frequenza di utilizzo
  • è usato più spesso nel discorso orale o scritto
  • opzioni di traduzione delle parole
  • esempi di utilizzo (varie frasi con traduzione)
  • etimologia

Cosa (chi) è residue cryptosystem - definizione

Damgaard-Jurik cryptosystem; Damgaard–Jurik cryptosystem; Damgård-Jurik cryptosystem; Damgard–Jurik cryptosystem; Damgard-Jurik cryptosystem

Residue (complex analysis)         
COEFFICIENT OF THE TERM OF ORDER −1 IN THE LAURENT EXPANSION OF A FUNCTION HOLOMORPHIC OUTSIDE A POINT, WHOSE VALUE CAN BE EXTRACTED BY A CONTOUR INTEGRAL
Residue of an analytic function; Residue at a pole; Complex residue; Residue (mathematics)
In mathematics, more specifically complex analysis, the residue is a complex number proportional to the contour integral of a meromorphic function along a path enclosing one of its singularities. (More generally, residues can be calculated for any function f\colon \mathbb{C} \setminus \{a_k\}_k \rightarrow \mathbb{C} that is holomorphic except at the discrete points {ak}k, even if some of them are essential singularities.
Residue theorem         
THE THEOREM THAT COMPLEX CONTOUR INTEGRALS ARE SIMPLY THE SUMS OF RESIDUES OF SINGULARITIES CONTAINED WITHIN THE CONTOUR
Cauchy residue theorem; Cauchy residue formula; Residue theory; Residue Theorem; Cauchy's Residue Theorem; Cauchys Residue Theorem; Cauchy Residue Theorem; Residue formula; Residue theorem of Cauchy; Cauchy's residue theorem
In complex analysis, the residue theorem, sometimes called Cauchy's residue theorem, is a powerful tool to evaluate line integrals of analytic functions over closed curves; it can often be used to compute real integrals and infinite series as well. It generalizes the Cauchy integral theorem and Cauchy's integral formula.
Poincaré residue         
GENERALIZATION OF THE CONCEPT OF RESIDUE OF A HOLOMORPHIC FUNCTION TO HIGHER DIMENSIONS
Poincare residue; Draft:Residue in several complex variables; Residue (complex geometry); Draft:Residue (Complex Geometry); Draft:Residue (complex geometry)
In mathematics, the Poincaré residue is a generalization, to several complex variables and complex manifold theory, of the residue at a pole of complex function theory. It is just one of a number of such possible extensions.

Wikipedia

Damgård–Jurik cryptosystem

The Damgård–Jurik cryptosystem is a generalization of the Paillier cryptosystem. It uses computations modulo n s + 1 {\displaystyle n^{s+1}} where n {\displaystyle n} is an RSA modulus and s {\displaystyle s} a (positive) natural number. Paillier's scheme is the special case with s = 1 {\displaystyle s=1} . The order φ ( n s + 1 ) {\displaystyle \varphi (n^{s+1})} (Euler's totient function) of Z n s + 1 {\displaystyle Z_{n^{s+1}}^{*}} can be divided by n s {\displaystyle n^{s}} . Moreover, Z n s + 1 {\displaystyle Z_{n^{s+1}}^{*}} can be written as the direct product of G × H {\displaystyle G\times H} . G {\displaystyle G} is cyclic and of order n s {\displaystyle n^{s}} , while H {\displaystyle H} is isomorphic to Z n {\displaystyle Z_{n}^{*}} . For encryption, the message is transformed into the corresponding coset of the factor group G × H / H {\displaystyle G\times H/H} and the security of the scheme relies on the difficulty of distinguishing random elements in different cosets of H {\displaystyle H} . It is semantically secure if it is hard to decide if two given elements are in the same coset. Like Paillier, the security of Damgård–Jurik can be proven under the decisional composite residuosity assumption.